Nteractive G Rounded L Anguage a Cquisition and G Eneralization in a 2 D W Orld

نویسندگان

  • Haonan Yu
  • Haichao Zhang
  • Wei Xu
چکیده

We build a virtual agent for learning language in a 2D maze-like world. The agent sees images of the surrounding environment, listens to a virtual teacher, and takes actions to receive rewards. It interactively learns the teacher’s language from scratch based on two language use cases: sentence-directed navigation and question answering. It learns simultaneously the visual representations of the world, the language, and the action control. By disentangling language grounding from other computational routines and sharing a concept detection function between language grounding and prediction, the agent reliably interpolates and extrapolates to interpret sentences that contain new word combinations or new words missing from training sentences. The new words are transferred from the answers of language prediction. Such a language ability is trained and evaluated on a population of over 1.6 million distinct sentences consisting of 119 object words, 8 color words, 9 spatial-relation words, and 50 grammatical words. The proposed model significantly outperforms five comparison methods for interpreting zero-shot sentences. In addition, we demonstrate human-interpretable intermediate outputs of the model in the appendix.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The metric dimension and girth of graphs

A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...

متن کامل

A User Friendly A T N Programming Environment (APE)

To dea l w i t h s p e c i f i c a l p h a b e t s i s a n e c e s s i t y tn n a t u r a l l anguage p r o c e s s i n g . I n G r e n o b l e , t h l s p r o b l e m i s s o l v e d w i t h h e l d o f t r a n s c r i p t i o n s . Here we p r e s e n t a l anguage (LT ) d e s i g n e d t o the r a p i d w r i t i n g o f passage f r om one t r a n s c r i p t i o n t o a n o t h e r ( t r a ...

متن کامل

Two Simple Prediction Algorithms To Facilitate Text Production

Severa l s imple p r e d i c t i o n schemes are p resen ted for sys tems in tended to f a c i l i ta te tex t p r o d u c t i o n fo r h a n d i c a p p e d ind iv idua ls . The schemes are based on s i n g l e s u b j e c t l anguage models , where the sys tem is s e l f a d a p t i n g to the past l anguage use of the subject . Sentence p o s i t i o n , the immed ia t e ly p reced ing one o...

متن کامل

On two-dimensional Cayley graphs

A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....

متن کامل

Solis Graphs and Uniquely Metric Basis Graphs

A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018